منابع مشابه
A quadratic lower bound for subset sums
Let A be a finite nonempty subset of an additive abelian group G, and let Σ(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |Σ(A)| ≥ |H|+ 1 64 |A \H|2 where H is the stabilizer of Σ(A). Our result implies that Σ(A) = Z/nZ for every set A of units of Z/nZ with |A| ≥ 8√n. This consequence was first proved by Erdős and Heilbronn for n prime, and by...
متن کاملA Quadratic Lower Bound for Homogeneous Algebraic Branching Programs
An algebraic branching program (ABP) is a directed acyclic graph, with a start vertex s, and end vertex t and each edge having a weight which is an affine form in F[x1, x2, . . . , xn]. An ABP computes a polynomial in a natural way, as the sum of weights of all paths from s to t, where the weight of a path is the product of the weights of the edges in the path. An ABP is said to be homogeneous ...
متن کاملA quadratic lower bound for the permanent and determinant problem
In Valiant’s theory of arithmetic complexity, the classes VP and VNP are analogs of P and NP. A fundamental problem concerning these classes is the Permanent and Determinant Problem: Given a field F of characteristic 6= 2, and an integer n, what is the minimum m such that the permanent of an n × n matrix X = (xij) can be expressed as a determinant of an m × m matrix, where the entries of the de...
متن کاملA Tight Lower Bound for the Adjacent Quadratic Assignment Problem
In this paper we address the Adjacent Quadratic Assignment Problem (AQAP) which is a variant of the QAP where the cost coefficient matrix has a particular structure. Motivated by strong lower bounds obtained by applying Reformulation Linearization Technique (RLT) to the classical QAP, we propose two special RLT representations for the problem. The first is based on a “flow” formulation whose li...
متن کاملA quadratic lower bound for colourful simplicial depth
We show that any point in the convex hull of each of (d+1) sets of (d+ 1) points in R is contained in at least ⌊
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.011